Fuzzy-model-based robust fault detection with stochastic mixed time-delays and successive packet dropouts

This is the Post-Print version of the Article. The official published version can be accessed from the link below - Copyright @ 2012 IEEEThis paper is concerned with the network-based robust fault detection problem for a class of uncertain discrete-time Takagi–Sugeno fuzzy systems with stochastic mixed time delays and successive packet dropouts. The mixed time delays comprise both the multiple discrete time delays and the infinite distributed delays. A sequence of stochastic variables is introduced to govern the random occurrences of the discrete time delays, distributed time delays, and successive packet dropouts, where all the stochastic variables are mutually independent but obey the Bernoulli distribution. The main purpose of this paper is to design a fuzzy fault detection filter such that the overall fault detection dynamics is exponentially stable in the mean square and, at the same time, the error between the residual signal and the fault signal is made as small as possible. Sufficient conditions are first established via intensive stochastic analysis for the existence of the desired fuzzy fault detection filters, and then, the corresponding solvability conditions for the desired filter gains are established. In addition, the optimal performance index for the addressed robust fuzzy fault detection problem is obtained by solving an auxiliary convex optimization problem. An illustrative example is provided to show the usefulness and effectiveness of the proposed design method.This work was supported in part by the National Natural Science Foundation of China under Grant 61028008, 60825303, 61004067, National 973 Project under Grant 2009CB320600, the Key Laboratory of Integrated Automation for the Process Industry (Northeastern University), Ministry of Education, the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. under Grant GR/S27658/01, the Royal Society of the U.K., the University of Hong Kong under Grant HKU/CRCG/200907176129 and the Alexander von Humboldt Foundation of Germany

Robust H∞ filtering for markovian jump systems with randomly occurring nonlinearities and sensor saturation: The finite-horizon case

This article is posted with the permission of IEEE - Copyright @ 2011 IEEEThis paper addresses the robust H∞ filtering problem for a class of discrete time-varying Markovian jump systems with randomly occurring nonlinearities and sensor saturation. Two kinds of transition probability matrices for the Markovian process are considered, namely, the one with polytopic uncertainties and the one with partially unknown entries. The nonlinear disturbances are assumed to occur randomly according to stochastic variables satisfying the Bernoulli distributions. The main purpose of this paper is to design a robust filter, over a given finite-horizon, such that the H∞ disturbance attenuation level is guaranteed for the time-varying Markovian jump systems in the presence of both the randomly occurring nonlinearities and the sensor saturation. Sufficient conditions are established for the existence of the desired filter satisfying the H∞ performance constraint in terms of a set of recursive linear matrix inequalities. Simulation results demonstrate the effectiveness of the developed filter design scheme.This work was supported in part by the National Natural Science Foundation of China under Grants 61028008, 60825303, and 61004067, National 973 Project under Grant 2009CB320600, the Key Laboratory of Integrated Automation for the Process Industry (Northeastern University) from the Ministry of Education of China, the Engineering and Physical Sciences Research Council (EPSRC) of the U.K., under Grant GR/S27658/01, the Royal Society of the U.K., and the Alexander von Humboldt Foundation of Germany

Compact printed multiband antenna with independent setting suitable for fixed and reconfigurable wireless communication systems

This is the author's accepted manuscript. The final published article is available from the link below. Copyright @ 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.This paper presents the design of a low-profile compact printed antenna for fixed frequency and reconfigurable frequency bands. The antenna consists of a main patch, four sub-patches, and a ground plane to generate five frequency bands, at 0.92, 1.73, 1.98, 2.4, and 2.9 GHz, for different wireless systems. For the fixed-frequency design, the five individual frequency bands can be adjusted and set independently over the wide ranges of 18.78%, 22.75%, 4.51%, 11%, and 8.21%, respectively, using just one parameter of the antenna. By putting a varactor (diode) at each of the sub-patch inputs, four of the frequency bands can be controlled independently over wide ranges and the antenna has a reconfigurable design. The tunability ranges for the four bands of 0.92, 1.73, 1.98, and 2.9 GHz are 23.5%, 10.30%, 13.5%, and 3%, respectively. The fixed and reconfigurable designs are studied using computer simulation. For verification of simulation results, the two designs are fabricated and the prototypes are measured. The results show a good agreement between simulated and measured results

A joint time-invariant filtering approach to the linear Gaussian relay problem

In this paper, the linear Gaussian relay problem is considered. Under the linear time-invariant (LTI) model the problem is formulated in the frequency domain based on the Toeplitz distribution theorem. Under the further assumption of realizable input spectra, the LTI Gaussian relay problem is converted to a joint design problem of source and relay filters under two power constraints, one at the source and the other at the relay, and a practical solution to this problem is proposed based on the projected subgradient method. Numerical results show that the proposed method yields a noticeable gain over the instantaneous amplify-and-forward (AF) scheme in inter-symbol interference (ISI) channels. Also, the optimality of the AF scheme within the class of one-tap relay filters is established in flat-fading channels.Comment: 30 pages, 10 figure

Error Rates of the Maximum-Likelihood Detector for Arbitrary Constellations: Convex/Concave Behavior and Applications

Motivated by a recent surge of interest in convex optimization techniques, convexity/concavity properties of error rates of the maximum likelihood detector operating in the AWGN channel are studied and extended to frequency-flat slow-fading channels. Generic conditions are identified under which the symbol error rate (SER) is convex/concave for arbitrary multi-dimensional constellations. In particular, the SER is convex in SNR for any one- and two-dimensional constellation, and also in higher dimensions at high SNR. Pairwise error probability and bit error rate are shown to be convex at high SNR, for arbitrary constellations and bit mapping. Universal bounds for the SER 1st and 2nd derivatives are obtained, which hold for arbitrary constellations and are tight for some of them. Applications of the results are discussed, which include optimum power allocation in spatial multiplexing systems, optimum power/time sharing to decrease or increase (jamming problem) error rate, an implication for fading channels ("fading is never good in low dimensions") and optimization of a unitary-precoded OFDM system. For example, the error rate bounds of a unitary-precoded OFDM system with QPSK modulation, which reveal the best and worst precoding, are extended to arbitrary constellations, which may also include coding. The reported results also apply to the interference channel under Gaussian approximation, to the bit error rate when it can be expressed or approximated as a non-negative linear combination of individual symbol error rates, and to coded systems.Comment: accepted by IEEE IT Transaction

Pairwise Check Decoding for LDPC Coded Two-Way Relay Block Fading Channels

Partial decoding has the potential to achieve a larger capacity region than full decoding in two-way relay (TWR) channels. Existing partial decoding realizations are however designed for Gaussian channels and with a static physical layer network coding (PLNC). In this paper, we propose a new solution for joint network coding and channel decoding at the relay, called pairwise check decoding (PCD), for low-density parity-check (LDPC) coded TWR system over block fading channels. The main idea is to form a check relationship table (check-relation-tab) for the superimposed LDPC coded packet pair in the multiple access (MA) phase in conjunction with an adaptive PLNC mapping in the broadcast (BC) phase. Using PCD, we then present a partial decoding method, two-stage closest-neighbor clustering with PCD (TS-CNC-PCD), with the aim of minimizing the worst pairwise error probability. Moreover, we propose the minimum correlation optimization (MCO) for selecting the better check-relation-tabs. Simulation results confirm that the proposed TS-CNC-PCD offers a sizable gain over the conventional XOR with belief propagation (BP) in fading channels.Comment: to appear in IEEE Trans. on Communications, 201

An Interaction Model for Simulation and Mitigation of Cascading Failures

In this paper the interactions between component failures are quantified and the interaction matrix and interaction network are obtained. The quantified interactions can capture the general propagation patterns of the cascades from utilities or simulation, thus helping to better understand how cascading failures propagate and to identify key links and key components that are crucial for cascading failure propagation. By utilizing these interactions a high-level probabilistic model called interaction model is proposed to study the influence of interactions on cascading failure risk and to support online decision-making. It is much more time efficient to first quantify the interactions between component failures with fewer original cascades from a more detailed cascading failure model and then perform the interaction model simulation than it is to directly simulate a large number of cascades with a more detailed model. Interaction-based mitigation measures are suggested to mitigate cascading failure risk by weakening key links, which can be achieved in real systems by wide area protection such as blocking of some specific protective relays. The proposed interaction quantifying method and interaction model are validated with line outage data generated by the AC OPA cascading simulations on the IEEE 118-bus system.Comment: Accepted by IEEE Transactions on Power System

Low-Complexity LP Decoding of Nonbinary Linear Codes

Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community in the past few years. LP decoding has been derived for binary and nonbinary linear codes. However, the most important problem with LP decoding for both binary and nonbinary linear codes is that the complexity of standard LP solvers such as the simplex algorithm remains prohibitively large for codes of moderate to large block length. To address this problem, two low-complexity LP (LCLP) decoding algorithms for binary linear codes have been proposed by Vontobel and Koetter, henceforth called the basic LCLP decoding algorithm and the subgradient LCLP decoding algorithm. In this paper, we generalize these LCLP decoding algorithms to nonbinary linear codes. The computational complexity per iteration of the proposed nonbinary LCLP decoding algorithms scales linearly with the block length of the code. A modified BCJR algorithm for efficient check-node calculations in the nonbinary basic LCLP decoding algorithm is also proposed, which has complexity linear in the check node degree. Several simulation results are presented for nonbinary LDPC codes defined over Z_4, GF(4), and GF(8) using quaternary phase-shift keying and 8-phase-shift keying, respectively, over the AWGN channel. It is shown that for some group-structured LDPC codes, the error-correcting performance of the nonbinary LCLP decoding algorithms is similar to or better than that of the min-sum decoding algorithm.Comment: To appear in IEEE Transactions on Communications, 201

Nested Lattice Codes for Gaussian Relay Networks with Interference

In this paper, a class of relay networks is considered. We assume that, at a node, outgoing channels to its neighbors are orthogonal, while incoming signals from neighbors can interfere with each other. We are interested in the multicast capacity of these networks. As a subclass, we first focus on Gaussian relay networks with interference and find an achievable rate using a lattice coding scheme. It is shown that there is a constant gap between our achievable rate and the information theoretic cut-set bound. This is similar to the recent result by Avestimehr, Diggavi, and Tse, who showed such an approximate characterization of the capacity of general Gaussian relay networks. However, our achievability uses a structured code instead of a random one. Using the same idea used in the Gaussian case, we also consider linear finite-field symmetric networks with interference and characterize the capacity using a linear coding scheme.Comment: 23 pages, 5 figures, submitted to IEEE Transactions on Information Theor

Interference Spins: Scheduling of Multiple Interfering Two-Way Wireless Links

Two-way is a dominant mode of communication in wireless systems. Departing from the tradition to optimize each transmission direction separately, recent work has demonstrated that, for time-division duplex (TDD) systems, optimizing the schedule of the two transmission directions depending on traffic load and interference condition leads to performance gains. In this letter, a general network of multiple interfering two-way links is studied under the assumption of a balanced load in the two directions for each link. Using the notion of interference spin, we introduce an algebraic framework for the optimization of two-way scheduling, along with an efficient optimization algorithm that is based on the pruning of a properly defined topology graph and dynamic programming. Numerical results demonstrate multi-fold rate gains with respect to baseline solutions, especially for worst-case (5%-ile) rates.Comment: Accepted for publication in IEEE Communications Letter